Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification
نویسندگان
چکیده
منابع مشابه
Computing Equilibria of Semi-algebraic Economies Using Triangular Decomposition and Real Solution Classification
In this paper, we are concerned with the problem of determining the existence of multiple equilibria in economic models. We propose a general and complete approach for identifying multiplicities of equilibria in semi-algebraic economies, which may be expressed as semi-algebraic systems. The approach is based on triangular decomposition and real solution classification, two powerful tools of alg...
متن کاملCompetitive equilibria in semi-algebraic economies
This paper develops a method to compute the equilibrium correspondence for exchange economies with semi-algebraic preferences. Given a class of semi-algebraic exchange economies parameterized by individual endowments and possibly other exogenous variables such as preference parameters or asset payoffs, there exists a semi-algebraic correspondence that maps parameters to positive numbers such th...
متن کاملReal Solution Classification for Parametric Semi-Algebraic Systems
Real solution classification of parametric polynomial systems is a crucial problem in real quantifier elimination which interests Volker Weispfenning and others. In this paper, we present a stepwise refinement algorithm for real solution classifications of a class of parametric systems consisting of polynomial equations, inequalities and inequations. For an input system, the algorithm outputs t...
متن کاملComputing Equilibria in Finance Economies
The general equilibrium model with incomplete asset markets provides a uni ed framework for many problems in nance and macroeconomics. In its simplest version with only two time periods and a single physical commodity the model is ideally suited for the study of problems in cross sectional asset pricing and portfolio theory. In this paper we develop a homotopy algorithm to approximate equilibri...
متن کاملComputing Intersection Multiplicity via Triangular Decomposition
Fulton’s algorithm is used to calculate the intersection multiplicity of two plane curves about a rational point. This work extends Fulton’s algorithm first to algebraic points (encoded by regular chains) and then, with some generic assumptions, to l many hypersurfaces. Out of necessity, we give a standard-basis free method (i.e. practically efficient method) for calculating tangent cones at po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Economics
سال: 2014
ISSN: 0304-4068
DOI: 10.1016/j.jmateco.2014.08.007